abelian covering造句

• The diamond crystal as an abstract graph is the maximal abelian covering graph of D 4.
• Diamond crystal as an abstract graph is the maximal abelian covering graph of the dipole graph D 4
• For example, the diamond crystal as a graph is the maximal abelian covering graph of the four-edge dipole graph.
• As a direct generalization, one can consider random walks on crystal lattices ( infinite-fold abelian covering graphs over finite graphs ).
• An infinite-fold abelian covering graph of a finite ( multi ) graph is called a topological crystal, an abstraction of crystal structures.
• "Blanchfield duality " is a version of Poincar?duality which provides an isomorphism between the homology of an abelian covering space of a manifold and the corresponding cohomology with compact supports.
• The " d "-dimensional integer lattice ( with unit length edges ) is the maximal abelian covering graph of a graph with one vertex and " d " self-loops.
• Using the same construction, the hexagonal tiling of the plane is the maximal abelian covering graph of the three-edge dipole graph, and the diamond cubic is the maximal abelian covering graph of the four-edge dipole.
• Using the same construction, the hexagonal tiling of the plane is the maximal abelian covering graph of the three-edge dipole graph, and the diamond cubic is the maximal abelian covering graph of the four-edge dipole.